Constrained type families
نویسندگان
چکیده
منابع مشابه
Constrained Type Families (extended version)
We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type families in Haskell provide a powerful, modular means of dening type-level computation. However, their current design implicitly assumes that type families are...
متن کاملConstrained Type Families (extended version), preprint
We present an approach to support partiality in type-level computation without compromising expressiveness or type safety. Existing frameworks for type-level computation either require totality or implicitly assume it. For example, type families in Haskell provide a powerful, modular means of dening type-level computation. However, their current design implicitly assumes that type families are...
متن کاملCompatible Families of Elliptic Type
In axiomatizing their study of Frobenius distributions [5], Lang and Trotter introduce the notion of an adelic Galois representation of elliptic type, and they ask in passing whether every such representation arises from an elliptic curve (see pp. 5 and 19 of [5]). Formulated in the language of `-adic representations [7], their question is as follows. Put G = Gal(Q/Q), let p denote a prime, and...
متن کاملType Inference with Constrained Types
In this paper we present a general framework HM(X) for Hindley/Milner style type systems with constraints. We give a generic type inference algorithm for HM(X). Under suucient conditions on X, type inference will always compute the principal type of a term. We give an extension of our HM(X) systems which deals with subtyping. In particular, the type inference algorithm for subtypes computes pri...
متن کاملType - constrained Generics for ZSamuel
We propose an extension to Z whereby generic parameters may have their types partially constrained. Using this mechanism it becomes possible to deene in Z much of its own schema calculus and re-nement rules.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the ACM on Programming Languages
سال: 2017
ISSN: 2475-1421
DOI: 10.1145/3110286